Regular colored graphs of positive degree
نویسندگان
چکیده
منابع مشابه
Partitioning Graphs of Regular Degree
Graph-Partitioning problems occur in a wide range of applications. The task is to divide the vertices of a graph in equally sized parts such that as few edges as possible are crossing the boundaries. The calculation of an optimal result is NP-complete. We show a new strategy to derive upper bounds on the bisection width of graphs with regular degree. It gives optimal upper bounds for very small...
متن کاملManifolds Associated with (z2)-colored Regular Graphs
This article describes a canonical way to expand certain kind of (Z2)colored regular graphs into closed n-manifolds (by adding cells determined by the edgecolorings inductively), and shows that every closed combinatorial n-manifold can be obtained in this way. Simple equivalent conditions for a colored graph to admit such expansion is also found in the case when n ≤ 3.
متن کاملErdõs regular graphs of even degree
In 1960, Dirac put forward the conjecture that r-connected 4critical graphs exist for every r ≥ 3. In 1989, Erdős conjectured that for every r ≥ 3 there exist r-regular 4-critical graphs. A method for finding r-regular 4-critical graphs and the numbers of such graphs for r ≤ 10 have been reported in [6, 7]. Results of a computer search for graphs of degree r = 12, 14, 16 are presented. All the ...
متن کاملRegular Steinhaus graphs of odd degree
A Steinhaus matrix is a binary square matrix of size n which is symmetric, with diagonal of zeros, and whose upper-triangular coefficients satisfy ai,j = ai−1,j−1+ai−1,j for all 2 6 i < j 6 n. Steinhaus matrices are determined by their first row. A Steinhaus graph is a simple graph whose adjacency matrix is a Steinhaus matrix. We give a short new proof of a theorem, due to Dymacek, which states...
متن کاملRegular Graphs of Odd Degree Are Antimagic
An antimagic labeling of a graph G with m edges is a bijection from E(G) to {1, 2, . . . ,m} such that for all vertices u and v, the sum of labels on edges incident to u differs from that for edges incident to v. Hartsfield and Ringel conjectured that every connected graph other than the single edge K2 has an antimagic labeling. We prove this conjecture for regular graphs of odd degree.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annales de l’Institut Henri Poincaré D
سال: 2016
ISSN: 2308-5827
DOI: 10.4171/aihpd/29